On monotone languages and their characterization by regular expressions
نویسنده
چکیده
In one of their papers, F. Gécseg and B. Imreh gave a characterization for monotone string languages by regular expressions. It has turned out that the monotone string languages are exactly those languages that can be represented by finite unions of seminormal chain languages. In this paper a similar characterization is given for monotone DR-languages.
منابع مشابه
On Nilpotent Languages and Their Characterization by Regular Expressions
Tree languages recognized by deterministic root-to-frontier recognizers are also called DR-languages. The concept of generalized R-chain languages was introduced by the author in his paper On monotone languages and their characterization by regular expressions (Acta Cybernetica, 18 (2007), 117134.) and it has turned out that the monotone DR-languages are exactly those languages that can be give...
متن کاملTOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES
We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...
متن کاملSynchronization Expressions: Characterization Results and Implementation
Synchronization expressions are deened as restricted regular expressions that specify synchronization constraints between parallel processes and their semantics is deened using synchronization languages. In this paper we survey results on synchronization languages, in particular various approaches to obtain an exact characterization of this language class using closure properties under a set of...
متن کاملPragmatic expressions in cross-linguistic perspective
This paper focuses on some pragmatic expressions that are characteristic of informal spoken English, their possible equivalents in some other languages, and their use by EFL learners from different backgrounds. These expressions, called general extenders (e.g. and stuff, or something), are shown to be different from discourse markers and to exhibit variation in form, funct...
متن کاملThe dual of concatenation 1
A binary language-theoretic operation is proposed, which is dual to the concatenation of languages in the same sense as the universal quantifier in logic is dual to the existential quantifier; the dual of Kleene star is defined accordingly. These operations arise whenever concatenation or star appear in the scope of negation. The basic properties of the new operations are determined in the pape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Acta Cybern.
دوره 18 شماره
صفحات -
تاریخ انتشار 2007